Remarks on Clifford Codes

نویسندگان

  • Andreas Klappenecker
  • Martin Rötteler
چکیده

Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer code. We derive a necessary and sufficient condition that allows to decide when a Clifford code is a stabilizer code, and compile a table of all true Clifford codes for error groups of small order.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond stabilizer codes II: Clifford codes

Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an abelian index group. In particular, if the errors are modelled by tensor products of Pauli matrices, then the associated Cli...

متن کامل

Clifford Analysis: History and Perspective

An introduction is given to basic parts of Clifford analysis including some historical remarks.

متن کامل

Beyond Stabilizer Codes

Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group is given by an extraspecial p-group. Suppose that the abstract error group has an abelian index group, then we show that a Clifford...

متن کامل

Encoding Subsystem Codes

In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the known results on encoding of stabilizer codes. Along the way we also show how Clifford codes can be encoded. We also show that gauge qubits can be exploited to...

متن کامل

Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras

It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not orthogonal also. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal De...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003